kw.\*:("Máquina única")
Results 1 to 25 of 865
Selection :
Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article
Single-machine scheduling with learning considerationsBISKUP, D.European journal of operational research. 1999, Vol 115, Num 1, pp 173-178, issn 0377-2217Article
Some remarks on the decomposition properties of the single machine total tardiness problemSZWARC, Wlodzimierz.European journal of operational research. 2007, Vol 177, Num 1, pp 623-625, issn 0377-2217, 3 p.Article
On-line scheduling with tight deadlinesKOO, Chiu-Yuen; LAM, Tak-Wah; NGAN, Tsuen-Wan et al.Lecture notes in computer science. 2001, pp 464-473, issn 0302-9743, isbn 3-540-42496-2Conference Paper
On the calculation of harmonic air-gap fields in machines with single-sided slottingWILLIAMSON, S; FENG, Y. N.IEE conference publication. 2006, pp 671-675, issn 0537-9989, isbn 0-86341-618-7, 1Vol, 5 p.Conference Paper
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervalsGORDON, Valery S; WERNER, F; YANUSHKEVICH, O. A et al.Operations research. 2001, Vol 35, Num 1, pp 71-83Article
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hardGUOHUA WAN; YEN, Benjamin P.-C; LI, Chung-Lun et al.Information processing letters. 2001, Vol 79, Num 6, pp 273-280, issn 0020-0190Article
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine = Temporal decomposation and caracterization of admissible solution for scheduling problem with single machineLEVY, M.-L; LOPEZ, P; PRADIN, B et al.RAIRO. Recherche opérationnelle. 1999, Vol 33, Num 2, pp 185-208, issn 0399-0559Article
A note on the bicriterion scheduling problem involving total flowtime and range of latenessALIDAEE, B; CONLON, S.International journal of information and management sciences. 1997, Vol 8, Num 2, pp 1-7, issn 1017-1819Article
Single machine scheduling problem with fuzzy precedence relationISHII, H; TADA, M.European journal of operational research. 1995, Vol 87, Num 2, pp 284-288, issn 0377-2217Article
Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA POUTRE, Han.Lecture notes in computer science. 2002, pp 872-883, issn 0302-9743, isbn 3-540-44180-8, 12 p.Conference Paper
Problèmes d'Ordonnancement Disjonctifs : Règles d'Élimination et Bornes Inférieures = Disjunctive Scheduling Problems : Elimination Rules and Lower BoundsRivreau, David; Pinson, Eric.1999, 120 p.Thesis
Scheduling grouped jobs on single machine with genetic algorithmDINGWEI WANG; MITSUO GEN; RUNWEI CHENG et al.Computers & industrial engineering. 1999, Vol 36, Num 2, pp 309-324, issn 0360-8352Article
Polynomially solvable total tardiness problems : Review and extensionsKOULAMAS, C.Omega (Oxford). 1997, Vol 25, Num 2, pp 235-239, issn 0305-0483Article
A class of single machine central tendency-dispersion bicriteria problemsMITTENTHAL, J; RAGHAVACHARI, M; RANA, A et al.The Journal of the Operational Research Society. 1996, Vol 47, Num 11, pp 1355-1365, issn 0160-5682Article
Decomposition of the single machine total tardiness problemSZWARC, W; MUKHOPADHYAY, S. K.Operations research letters. 1996, Vol 19, Num 5, pp 243-250, issn 0167-6377Article
Implementing and testing the tabu cycle and conditional probability methodsLAGUNA, Manuel.Computers & operations research. 2006, Vol 33, Num 9, pp 2495-2507, issn 0305-0548, 13 p.Article
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterionKASPERSKI, Adam.Operations research letters. 2005, Vol 33, Num 4, pp 431-436, issn 0167-6377, 6 p.Article
On the single machine total tardiness problemTIAN, Z. J; NG, C. T; CHENG, T. C. E et al.European journal of operational research. 2005, Vol 165, Num 3, pp 843-846, issn 0377-2217, 4 p.Article
A hybrid branch-and-cut algorithm for the one-machine scheduling problemSADYKOV, Ruslan.Lecture notes in computer science. 2004, pp 409-414, issn 0302-9743, isbn 3-540-21836-X, 6 p.Conference Paper
Combining phrase-based and template-based alignment models in statistical translationTOMAS, Jesus; CASACUBERTA, Francisco.Lecture notes in computer science. 2003, pp 1020-1031, issn 0302-9743, isbn 3-540-40217-9, 12 p.Conference Paper
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machineCHRETIENNE, Philippe.Operations research. 2001, Vol 35, Num 2, pp 165-187Conference Paper
Bi-criterion optimization with multi colony ant algorithmsIREDI, Steffen; MERKLE, Daniel; MIDDENDORF, Martin et al.Lecture notes in computer science. 2001, pp 359-372, issn 0302-9743, isbn 3-540-41745-1Conference Paper
Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costsHUSSAIN, S. A; SASTRY, V. U. K.International journal of computer mathematics. 1999, Vol 70, Num 3, pp 383-391, issn 0020-7160Article
A two-stage hybrid flowshop with uniform machines and setup timesHUANG, W; LI, S.Mathematical and computer modelling. 1998, Vol 27, Num 2, pp 27-45, issn 0895-7177Article